Dynamic Transition Refinement
نویسندگان
چکیده
Refinement of Petri nets is well suited for the hierarchical design of system models. It is used to represent a model at different levels of abstraction. Usually, refinement is a static concept. For many scenarios, however, it is desirable to have a more flexible form of refinement. For example in the context of service updates, e.g. version control in distributed systems, a mechanism for dynamic transition refinement is needed. The requirement of dynamic refinement at runtime is quite strong. Since we would like to redefine the system structure by itself, transition refinement cannot be implemented by a model transformation. Instead, an approach is needed which allows for dynamic net structures that can evolve as an effect of transitions firing. In previous work we introduced nets-within-nets as a formalism for the dynamic refinement of tokens. Here we consider an extension of nets-within-nets that uses special net tokens describing the refinement structure of transitions. Using this formalism it is possible to update refinements, introduce alternative refinements, etc. We present some formal properties of the extended formalism and introduce an example implementation for the tool Renew in the context of workflow modeling.
منابع مشابه
ASM refinement and generalizations of forward simulation in data refinement: a comparison
In [1], we have formalized Börger’s refinement notion for Abstract State Machines (ASMs). The formalization was based on transition systems, and verification conditions were expressed in Dynamic Logic. In this paper, the relation between ASM refinement and data refinement is explored. Data refinement expresses operations and verification conditions using relational calculus. We show how to brid...
متن کاملFuzzy Labeled Transition Refinement Tree: Application to Stepwise Designing Multi Agent Systems
This paper aims to provide a formal framework that supports an incremental development of dynamic systems such as multi agents systems (MAS). We propose a fuzzy labeled transition system model (FLTS for short). FLTS allows a concise action refinement representation and deals with incomplete information through its fuzziness representation. Afterward, based on FLTS model, we propose a refinement...
متن کاملLimit of Dislocation Density and Ultra-Grain-Refining on Severe Deformation in Iron
It is well-known that severe deformation to metals causes a direct grain refinement of the matrix without special heat-treatments due to the mechanism of dynamic continuous recrystallization (DCR). However, the microstructural revolution during severe deformation is seemed to be different depending on the deformation mode, namely the direction of deformation. In general, multi-directional defor...
متن کاملDynamic Reactive Modules
State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/...
متن کاملBisimilarity and refinement for hybrid(ised) logics
The complexity of modern software systems entails the need for reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimulus or internal performance measures. Formally, such systems may be represented by transition systems whose nodes correspond to the different configurations they may assume. Therefore, each node is endowed w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 175 شماره
صفحات -
تاریخ انتشار 2007